On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
نویسندگان
چکیده
منابع مشابه
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F . The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigat...
متن کاملParameterizations of hitting set of bundles and inverse scope
Hitting Set of Bundles generalizes the ordinary Hitting Set problem in the way that prescribed bundles of elements rather than single elements have to be put in a hitting set. The goal is to minimize the total number of distinct elements in the solution. First we prove that Hitting Set of Bundles, with the number of hyperedges and the solution size as parameter, is W [1]-complete. This contrast...
متن کاملKernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
In the Hitting Set problem, we are given a collection F of subsets of a ground set V and an integer p, and asked whether V has a p-element subset that intersects each set in F . We consider two parameterizations of Hitting Set below tight upper bounds: p = m − k and p = n − k. In both cases k is the parameter. We prove that the first parameterization is fixed-parameter tractable, but has no pol...
متن کاملOn the Hitting Set of Bundles Problem
Le problème de l’ensemble minimal de paquets (minimal hitting set of bundles problem ou HSB) est défini comme suit. On dispose d’un ensemble E = {e1, e2, . . . , en} de n éléments. Chaque élément ei (i = 1, . . . , n) a un coût positif ou nul ci. Un paquet b est un sous ensemble de E . On dispose aussi d’une collection S = {S1, S2, . . . , Sm} de m ensembles de paquets. De manière plus précise,...
متن کاملImproved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of points that hit all geometric objects. The problem is known to be strongly NP-hard even for simple geometric objects like unit disks in the plane. Therefore, unless P=NP, it is not possible to get Fully Polynomial Time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2017
ISSN: 1526-1719
DOI: 10.7155/jgaa.00413